Large dimensional analysis of general margin based classification methods

نویسندگان

چکیده

Margin-based classifiers have been popular in both machine learning and statistics for classification problems. Since a large number of are available, one natural question is which type should be used given particular task. We answer this by investigating the asymptotic performance family large-margin under two component mixture models situations where data dimension $p$ sample $n$ large. This covers broad range including support vector machine, distance weighted discrimination, penalized logistic regression, unified as special cases. The results described set nonlinear equations we observe close match them with Monte Carlo simulation on finite samples. Our analytical studies shed new light how to select best classifier among various methods well choose optimal tuning parameters method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Analysis of Some Multi-Category Large Margin Classification Methods

The purpose of this paper is to investigate statistical properties of risk minimization based multicategory classification methods. These methods can be considered as natural extensions of binary large margin classification. We establish conditions that guarantee the consistency of classifiers obtained in the risk minimization framework with respect to the classification error. Examples are pro...

متن کامل

Two dimensional Large Margin Nearest Neighbor for Matrix Classification

Matrices are a common form of data encountered in a wide range of real applications. How to efficiently classify this kind of data is an important research topic. In this paper, we propose a novel distance metric learning method named two dimensional large margin nearest neighbor (2DLMNN), for improving the performance of k-nearest neighbor (KNN) classifier in matrix classification. Different f...

متن کامل

Coherence functions with applications in large-margin classification methods

Support vector machines (SVMs) naturally embody sparseness due to their use of hinge loss functions. However, SVMs can not directly estimate conditional class probabilities. In this paper we propose and study a family of coherence functions, which are convex and differentiable, as surrogates of the hinge function. The coherence function is derived by using the maximum-entropy principle and is c...

متن کامل

Multicategory large margin classification methods: Hinge losses vs. coherence functions

Article history: Received 3 August 2013 Received in revised form 9 May 2014 Accepted 16 June 2014 Available online 20 June 2014

متن کامل

Convergence of Large Margin Separable Linear Classification

Large margin linear classification methods have been successfully applied to many applications. For a linearly separable problem, it is known that under appropriate assumptions, the expected misclassification error of the computed “optimal hyperplane” approaches zero at a rate proportional to the inverse training sample size. This rate is usually characterized by the margin and the maximum norm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2021

ISSN: ['1742-5468']

DOI: https://doi.org/10.1088/1742-5468/ac2edd